General normal forms for any additive logic
نویسندگان
چکیده
منابع مشابه
Normal Forms for Defeasible Logic
Defeasible logic is an important logic-programming based nonmonotonic reasoning formalism which has an eecient implementation. It makes use of facts, strict rules, defeasible rules, defeaters, and a superiority relation. Representation results are important because they can help the assimilation of a concept by connning attention to its critical aspects. In this paper we derive some representat...
متن کاملNormal Forms for Inductive Logic Programming
In this paper we study induction of unrestricted clausal theories from interpretations. First, we show that in the propositional case induction from complete evidence can be seen as an equivalence-preserving transformation from DNF to CNF. From this we conclude that induction i s essentially a process of determining what is false in the domain of discourse. We then proceed by investigating dual...
متن کاملDescription Logic Programs: Normal Forms
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms – namely Description Logics (DLs) and Logic Programming – are the two most successful approaches. A study of their exact relationships is thus paramount....
متن کاملNormal Forms in Combinatory Logic
Let R be a convergent term rewriting system, and let CR-equality on (simply typed) combinatory logic terms be the equality induced by βηRequality on terms of the (simply typed) lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates CR-equality a...
متن کاملNormal forms for general polynomial matrices
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two matrix polynomials (in normal form) or such polynomial normal form computation as the classical Popov form and the Hermite Normal Form. The method is done by embedding the problem of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Scientiarum Mathematicarum Hungarica
سال: 2017
ISSN: 0081-6906,1588-2896
DOI: 10.1556/012.2017.54.3.1372